Theoretical -arithmetic basis of bit-logarithmic digital representation
نویسندگان
چکیده
منابع مشابه
Options for Denormal Representation in Logarithmic Arithmetic
Economical hardware often uses a FiXed-point Number System (FXNS), whose constant absolute precision is acceptable for many signal-processing algorithms. The almost-constant relative precision of the more expensive Floating-Point (FP) number system simplifies design, for example, by eliminating worries about FXNS overflow because the range of FP is much larger than FXNS for the same wordsize; h...
متن کاملLow Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
Bit-parallel finite field multiplication in F2m using polynomial basis can be realized in two steps: polynomial multiplication and reduction modulo the irreducible polynomial. In this article, we prove that the modular polynomial reduction can be done with (r − 1)(m − 1) bit additions, where r is the Hamming weight of the irreducible polynomial. We also show that a bit-parallel squaring operati...
متن کاملA 32-Bit Logarithmic Arithmetic Unit and its Performance Compared to Floating-Point
As an alternative to floating-point, several papers have proposed the use of a logarithmic number system, in which a real number is represented as a fixed-point logarithm. Multiplication and division therefore proceed in minimal time with no rounding error. However, the system can only offer an overall advantage if addition and subtraction can be performed with speed and accuracy at least equal...
متن کاملArithmetic around the bit heap
A bit heap is a data structure that holds the unevaluated sum of an arbitrary number of bits, each weighted by some power of two. Any multivariate polynomial of binary inputs can be expressed as a bit heap whose bits are simple boolean functions of the input bits. For many large arithmetic designs, viewing them as bit heaps is more relevant than viewing them as a composition of adders and multi...
متن کاملFrom Logarithmic Advice to Single-Bit Advice
Building on Barak’s work (Random’02), Fortnow and Santhanam (FOCS’04) proved a time hierarchy for probabilistic machines with one bit of advice. Their argument is based on an implicit translation technique, which allow to translate separation results for short (say logarithmic) advice (as shown by Barak) into separations for a single-bit advice. In this note, we make this technique explicit, by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Informatization and Management
سال: 2007
ISSN: 2073-4751
DOI: 10.18372/2073-4751.1.9038